Inapproximability of survivable networks

Inapproximability of Survivable Networks

In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation ratio preserving reduction from Directed SNDP to Undirected SNDP. Our reduction extends and widely generalizes as well as significantly simplifies the main results of [9]. Using it, we derive some new hardness of approx...

Designing Hierarchical Survivable Networks

As the computer, communication, and entertainment industries begin to integrate phone, cable, and video services and to invest in new technologies such as fiber optic cables, interruptions in service can cause considerable customer dissatisfaction and even be catastrophic. In this environment, network providers want to offer high levels of servicein both serviceability (e.g., high bandwidth) an...

Survivable Bluetooth location networks

In this paper, we analyze survivability issues of Bluetooth Location Networks (BLN) for location-aware or context-driven mobile networks, such as m-commerce environments or e-museums. We assume that, in any of those scenarios, there exist service servers that need to know user location in real-time, to send context-oriented information to user handhelds when necessary. The BLN transmits positio...

Survivable Systems & Networks

Survivable Optical Backbone Networks

Given the wide range of services to be offered by future optical backbone networks, network survivability becomes a quintessential aspect of network design. The survivability schemes of such networking infrastructures can be realized in two basic forms, viz., restoration-based and protection-based schemes or an appropriate combination of both. This article provides a brief overview of survivabl...